A Polynomial Kernel for 3-Leaf Power Deletion

For a non-negative integer $$\ell $$ , the -leaf power of tree T is simple graph G on leaves such that two vertices are adjacent in if and only their distance at most . We provide polynomial kernel for problem deciding whether we can delete k to make an input 3-leaf some tree. More specifically, present polynomial-time algorithm instance (G, k) output equivalent $$(G',k')$$ $$k'\leqslant k$$ $$G'$$ has $$O(k^{14})$$ vertices.